Edge condition for hamiltonicity in balanced tripartite graphs

A sufficient condition for Hamiltonicity in locally finite graphs

Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives a sufficient condition for Hamiltonicity in locally finite graphs.

A clique-covering sufficient condition for hamiltonicity of graphs

note on edge distance-balanced graphs

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

n-EDGE-DISTANCE-BALANCED GRAPHS

Throughout this paper, we present a new class of graphs so-called n-edgedistance-balanced graphs inspired by the concept of edge-distance-balanced property initially introduced by Tavakoli et al. [Tavakoli M., Yousefi-Azari H., Ashrafi A.R., Note on edge distance-balanced graphs, Trans. Combin. 1 (1) (2012), 1-6]. Moreover, we propose some characteristic results to recognize 2-edge-distance-bal...

Condition for tripartite entanglement

We propose a scheme for classifying the entanglement of a tripartite pure qubit state. This classification scheme consists of an ordered list of seven elements. These elements are the Cayley hyper-determinant, and its six associated 2 × 2 subdeterminants. In particular we show that this classification provides a necessary and sufficient condition for separability.